Wiener index of quadrangulation graphs

نویسندگان

چکیده

The Wiener index of a graph G, denoted W(G), is the sum distances between all non-ordered pairs vertices in G.É. Czabarka, et al. conjectured that for simple quadrangulation G on n vertices, n?4, W(G)?112n3+76n?2,n?0(mod2), 112n3+1112n?1,n?1(mod2).In this paper, we confirm conjecture.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wiener Polarity Index of Tensor Product of Graphs

Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...

متن کامل

Wiener Index of Graphs in Terms of Eccentricities

The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.

متن کامل

MORE ON EDGE HYPER WIENER INDEX OF GRAPHS

‎Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge‎ ‎set E(G)‎. ‎The (first) edge-hyper Wiener index of the graph G is defined as‎: ‎$$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$‎ ‎where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). ‎In thi...

متن کامل

On the Wiener Index of Some Edge Deleted Graphs

The sum of distances between all the pairs of vertices in a connected graph is known as the {it Wiener index} of the graph. In this paper, we obtain the Wiener index of edge complements of stars, complete subgraphs and cycles in $K_n$.

متن کامل

Wiener Index of Graphs using Degree Sequence

The Wiener index of a graph is defined as the sum of distances between all pairs of vertices in a connected graph. Wiener index correlates well with many physio chemical properties of organic compounds and as such has been well studied over the last quarter of a century. In this paper we prove some general results on Wiener Index for graphs using degree sequence.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2021

ISSN: ['1872-6771', '0166-218X']

DOI: https://doi.org/10.1016/j.dam.2020.11.016